On the power divergence in quasi gluon distribution function

Recent perturbative calculation of quasi gluon distribution function at one-loop level shows the existence of extra linear ultraviolet divergences in the cut-off scheme. We employ the auxiliary field approach, and study the renormalization of gluon operators. The non-local gluon operator can mix with new operators under renormalization, and the linear divergences in quasi distribution function can be into the newly introduced operators. After including the mixing, we find the improved quasi gluon distribution functions contain only logarithmic divergences, and thus can be used to extract the gluon distribution in large momentum effective theory.Comment: 18 pages, 10 figures. Published version in JHE

Paradigm and paradox in topology control of power grids

Corrective Transmission Switching can be used by the grid operator to relieve line overloading and voltage violations, improve system reliability, and reduce system losses. Power grid optimization by means of line switching is typically formulated as a mixed integer programming problem (MIP). Such problems are known to be computationally intractable, and accordingly, a number of heuristic approaches to grid topology reconfiguration have been proposed in the power systems literature. By means of some low order examples (3-bus systems), it is shown that within a reasonably large class of “greedy” heuristics, none can be found that perform better than the others across all grid topologies. Despite this cautionary tale, statistical evidence based on a large number of simulations using IEEE 118-bus systems indicates that among three heuristics, a globally greedy heuristic is the most computationally intensive, but has the best chance of reducing generation costs while enforcing N-1 connectivity. It is argued that, among all iterative methods, the locally optimal switches at each stage have a better chance in not only approximating a global optimal solution but also greatly limiting the number of lines that are switched.First author draf

Sequential Selection of Correlated Ads by POMDPs

Online advertising has become a key source of revenue for both web search engines and online publishers. For them, the ability of allocating right ads to right webpages is critical because any mismatched ads would not only harm web users' satisfactions but also lower the ad income. In this paper, we study how online publishers could optimally select ads to maximize their ad incomes over time. The conventional offline, content-based matching between webpages and ads is a fine start but cannot solve the problem completely because good matching does not necessarily lead to good payoff. Moreover, with the limited display impressions, we need to balance the need of selecting ads to learn true ad payoffs (exploration) with that of allocating ads to generate high immediate payoffs based on the current belief (exploitation). In this paper, we address the problem by employing Partially observable Markov decision processes (POMDPs) and discuss how to utilize the correlation of ads to improve the efficiency of the exploration and increase ad incomes in a long run. Our mathematical derivation shows that the belief states of correlated ads can be naturally updated using a formula similar to collaborative filtering. To test our model, a real world ad dataset from a major search engine is collected and categorized. Experimenting over the data, we provide an analyse of the effect of the underlying parameters, and demonstrate that our algorithms significantly outperform other strong baselines

Paradigm and Paradox in Topology Control of Power Grids

Corrective Transmission Switching can be used by the grid operator to relieve line overloading and voltage violations, improve system reliability, and reduce system losses. Power grid optimization by means of line switching is typically formulated as a mixed integer programming problem (MIP). Such problems are known to be computationally intractable, and accordingly, a number of heuristic approaches to grid topology reconfiguration have been proposed in the power systems literature. By means of some low order examples (3-bus systems), it is shown that within a reasonably large class of greedy heuristics, none can be found that perform better than the others across all grid topologies. Despite this cautionary tale, statistical evidence based on a large number of simulations using using IEEE 118- bus systems indicates that among three heuristics, a globally greedy heuristic is the most computationally intensive, but has the best chance of reducing generation costs while enforcing N-1 connectivity. It is argued that, among all iterative methods, the locally optimal switches at each stage have a better chance in not only approximating a global optimal solution but also greatly limiting the number of lines that are switched

Holographic model of hybrid and coexisting s-wave and p-wave Josephson junction

In this paper the holographic model for hybrid and coexisting s-wave and p-wave Josephson junction is constructed by a triplet charged scalar field coupled with a non-Abelian $SU(2)$ gauge fields in (3+1)-dimensional AdS spacetime. Depending on the value of chemical potential $\mu$, one can show that there are four types of junctions (s+p-N-s+p, s+p-N-s, s+p-N-p and s-N-p). We show that DC current of all the hybrid and coexisting s-wave and p-wave junctions is proportional to the sine of the phase difference across the junction. In addition, the maximum current and the total condensation decays with the width of junction exponentially, respectively. For s+p-N-s and s-N-p junction, the maximum current decreases with growing temperature. Moreover, we find that the maximum current increases with growing temperature for s+p-N-s+p and s+p-N-p junction, which is in the different manner as the behaviour of s+p-N-s and s-N-p junction.Comment: 20 pages, 12 figures, v2: typos corrected, references added, published versio

Real-time Bidding for Online Advertising: Measurement and Analysis

The real-time bidding (RTB), aka programmatic buying, has recently become the fastest growing area in online advertising. Instead of bulking buying and inventory-centric buying, RTB mimics stock exchanges and utilises computer algorithms to automatically buy and sell ads in real-time; It uses per impression context and targets the ads to specific people based on data about them, and hence dramatically increases the effectiveness of display advertising. In this paper, we provide an empirical analysis and measurement of a production ad exchange. Using the data sampled from both demand and supply side, we aim to provide first-hand insights into the emerging new impression selling infrastructure and its bidding behaviours, and help identifying research and design issues in such systems. From our study, we observed that periodic patterns occur in various statistics including impressions, clicks, bids, and conversion rates (both post-view and post-click), which suggest time-dependent models would be appropriate for capturing the repeated patterns in RTB. We also found that despite the claimed second price auction, the first price payment in fact is accounted for 55.4% of total cost due to the arrangement of the soft floor price. As such, we argue that the setting of soft floor price in the current RTB systems puts advertisers in a less favourable position. Furthermore, our analysis on the conversation rates shows that the current bidding strategy is far less optimal, indicating the significant needs for optimisation algorithms incorporating the facts such as the temporal behaviours, the frequency and recency of the ad displays, which have not been well considered in the past.Comment: Accepted by ADKDD '13 worksho